Program synthesis using abstraction refinement
نویسندگان
چکیده
منابع مشابه
Abstraction Refinement for Separation Logic Program Analyses
ion Refinement for Separation Logic Program Analyses Matko Botinčan, Mike Dodds, and Stephen Magill 1 University of Cambridge, {matko.botincan,mike.dodds}@cl.cam.ac.uk 2 [email protected] Abstract. Abstract domains based on separation logic allow the compositional analysis of heap-manipulating programs, and their effectiveness on real-world software has been extensively demonstrated. Tra...
متن کاملCounterexample Guided Abstraction Refinement Via Program Execution
Software model checking tools based on a Counterexample Guided Abstraction Refinement (CEGAR) framework have attained considerable success in limited domains. However, scaling these approaches to larger programs with more complex data structures and initialization behavior has proven difficult. Explicit-state model checkers making use of states and operational semantics closely related to actua...
متن کاملSynthesis of Supervisory Controllers for Hybrid Systems Using Abstraction Refinement
For the computationally challenging task of synthesizing supervisory controllers for hybrid systems, this paper suggests to use guided abstraction refinement. Starting from a discrete abstraction of the hybrid model, so-called candidate paths are determined as possible controlled evolutions which satisfy given specifications for safety and goal attainment. A specialized validation procedure is ...
متن کاملCompositional abstraction refinement for control synthesis
This paper presents a compositional approach to specification-guided abstraction refinement for control synthesis of a nonlinear system associated with a method to over-approximate its reachable sets. Given an initial coarse partition of the state space, the control specification is given as a sequence of the cells of this partition to visit at each sampling time. The dynamics are decomposed in...
متن کاملScheduling Constraint Based Abstraction Refinement for Multi-Threaded Program Verification
Bounded model checking is among the most ecient techniques for the automatic verication of concurrent programs. However, encoding all possible interleavings oen requires a huge and complex formula, which signicantly limits the salability. is paper proposes a novel and ecient abstraction renement method for multi-threaded program verication. Observing that the huge formula is usually dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2018
ISSN: 2475-1421
DOI: 10.1145/3158151